Fast search in a music sharing environment

ABSTRACT

A method, apparatus and system of method and system of directory sharing and management in a group communication environment is disclosed. In one embodiment, a method of a fast-search server includes processing a character of a query of music data, referencing the character with a reverse index of a music database, determining that the character matches a data record of the music database using the reverse index and returning the data record of the music database prior to receiving all characters of the query of music data from a user. The reverse index may be created from a combination of letters appearing as a string in a data field of the music database. The method may include preforking the character of the query of music data along with other processes in the fast-search server to minimize concurrency issues and to minimize threading locks.

CROSS REFERENCE TO RELATED APPLICATION

This application is a continuation of U.S. patent application Ser. No.14/229,696 which was filed on Mar. 28, 2014 entitled “FAST SEARCH IN AMUSIC SHARING ENVIRONMENT”, which in turn, is a continuation applicationof U.S. patent application Ser. No. 12/031,697 which was filed on Feb.14, 2008 entitled “FAST SEARCH IN A MUSIC SHARING ENVIRONMENT”, which isincorporated herein by reference in its entirety.

FIELD OF TECHNOLOGY

This disclosure relates generally to the technical fields of softwareand database technology and, in one example embodiment, to a method andsystem of directory sharing and management in a group communicationenvironment.

BACKGROUND

A user may enter a query in a search engine (e.g., MOG®, Imeem®, Spock®,Pandora®, Zillow®, Yelp®, etc.) optimized for a specific type of data(e.g., music, people search, lyrics, real estate, reviews, etc.). Theuser may have to enter all characters of the query in the search engineand click on a ‘submit’ button to transmit the query to a server havingthe specific type of data.

The user may be fatigued to enter the query entirely in the searchengine every time the user wishes to search for the specific type ofdata. Furthermore, the user may become frustrated with an amount of timethe user may have to wait to receive a response from a server having thespecific type of data. As a result, the user may begin looking for analternative search engine that delivers a faster search response for thespecific type of data.

SUMMARY

A method and system of fast search in a music sharing environment isdisclosed. In one aspect, a method of a fast-search server includesprocessing a character of a query of music data, referencing thecharacter with a reverse index of a music database (e.g., may includealbums, tracks, artist information, etc.), determining that thecharacter matches a data record (e.g., text matching with the recorddata) of the music database using the reverse index and returning thedata record of the music database prior to receiving all characters ofthe query of music data (e.g., for albums, for artists, etc.) from auser (e.g., the person who wants the music data).

The reverse index may be created from a combination of letters appearingas a string in a data field of the music database including an artistfield, an album field and/or a track field. The method may includestoring a search data (e.g., may include the previous characters typedin the query and/or other characters provided by different usersquerying the data record) of the user and other users in a local cache(e.g., a store for previous queries, a collection of previous records,etc.) of a client device (e.g., a computer, a mobile phone, etc.) tooptimize speed of returning the data record of the music database priorto receiving all characters of the query of music data from the user.The method may also include storing a results data (e.g., may includethe data record matching the search data) of the user and other users inthe local cache of the client device to further optimize speed ofreturning the data record of the music database prior to receiving allcharacters of the query of music data from the user.

In addition, the method may include preforking the character of thequery of music data along with other processes in the fast-search serverto minimize concurrency issues and to minimize threading locks. Themethod may also include applying the local cache to retrieve a previousdata record of previous characters typed in the query of music databefore the user entered the character of the query through anapplication of the search data (e.g., using search cache) and theresults data (e.g., using results cache) of the local cache in providingthe previous data record when the user deletes an entry of the characterof the query from the query.

The method may hold the character of the query of music data in theclient device without transmitting the character to the fast-searchserver when the character of the query of music data may be included ina string having a set of characters ‘t’, ‘h’, and ‘e’ as firstcharacters of the query of music data provided by the user when a setamount of time between keystrokes is not exceeded. The method maytransmit the character of the query of music data in the client deviceto the fast-search server when the character of the query of music datamay be a character ‘t’ included in the string having the set ofcharacters ‘t’, ‘h’, and ‘e’ as the first characters of the query ofmusic data provided by the user when the set amount of time betweenkeystrokes may be exceeded after entering the character ‘t’.

The method may further include applying a timer (e.g., system clock) inthe client device to measure the set amount of time between keystrokes.An optimal time between keystrokes may be approximately 200milliseconds. The method may include holding a first three characters ofthe query of music data in the client device without transmitting thecharacter to the fast-search server when the set amount of time betweenkeystrokes may be within the optimal time between keystrokes.

The method may transmit a first four characters of the query of musicdata in the client device to the fast-search server regardless of theset amount of time between keystrokes being within the optimal timebetween keystrokes to optimize an experience of the user to feel thatthe fast-search server may quickly responsive to the user. The methodmay also include holding a ‘blank space’ character of the query of musicdata in the client device without transmitting the ‘blank space’character to the fast-search server to minimize trips between the clientdevice and the fast-search server.

The method may apply a spelling index of the fast-search server whichreferences a misspelling database of a central server to determinewhether the query of music data may be a misspelling of the data recordof the central server. The method may also include altering themisspelling of the query of music data to a correct spelling when thequery of music data may be determined to be the misspelling of the datarecord.

In another aspect, a method of improving music search responsivenessinclude determining that a partial entry of a query of music data mayincluded in a local cache of a client device built from previoussearches of users of a central server having the music data, andreturning a data record from the local cache based on the previoussearches of users of the central server having the music data.

The method may hold the partial entry of the query of music data in theclient device without transmitting the partial entry to a fast-searchserver when characters of the partial entry are included in a stringhaving a set of characters ‘t’, ‘h’, and ‘e’ as first characters of thequery of music data provided by the user when a set amount of timebetween keystrokes is not exceeded. The method may transmit the partialentry of the query of music data in the client device to the fast-searchserver when a character of the partial entry may be a character ‘t’included in the string having the set of characters ‘t’, ‘h’ and ‘e’ asthe first characters of the query of music data provided by the userwhen the set amount of time between keystrokes is exceeded afterentering the character ‘t’.

The method may also include applying a timer in the client device tomeasure the set amount of time between keystrokes. An optimal timebetween keystrokes may be approximately 200 milliseconds. The method mayhold the partial entry in the client device without transmitting thepartial entry to the fast-search server when the partial entry may befirst three characters of the query of music data when the set amount oftime between keystrokes is within the optimal time between keystrokes.

The method may transmit the partial entry in the client device to thefast-search server regardless of the set amount of time betweenkeystrokes being within the optimal time between keystrokes when thepartial entry may be a first four characters of the query of music datato optimize an experience of the user to feel that the fast-searchserver may quickly responsive to the user. The method may hold thepartial entry in the client device without transmitting the partialentry to the fast-search server when the partial entry is a ‘blankspace’ character of the query of music data to minimize trips betweenthe client device and the fast-search server.

In yet another aspect, a system includes a central server to provide adata records of a music database a fast-search server coupled to thecentral server having a processing module to monitor and be responsiveto a partial entry of a query of the data records of the music databaseusing a reverse index of the data records of the music database anetwork of a client device coupled to the central server, thefast-search server through the network to locally cache previous partialsearches and results of a users of client devices which query the datarecords of the music database of the central server.

In addition, the system may include a spelling module of the fast-searchserver to apply a spelling index which references a misspelling databaseof the central server to determine whether a query of music data may bea misspelling of the data records of the central server. The spellingmodule of the system may alter the misspelling of the query of musicdata to a correct spelling when the query of music data is determined tobe the misspelling of one of the data records.

In addition, the system may include an optimization module of the clientdevice to hold the partial entry of the query of the data records of themusic database in the client device without transmitting the partialentry to the fast-search server when characters of the partial entry arepart of a string having a set of characters ‘t’, ‘h’, and ‘e’ as firstcharacters of the query of the data records of the music database when aset amount of time between keystrokes is not exceeded. The optimizationmodule of the system may also transmit the partial entry of the query ofmusic data in the client device to the fast-search server when acharacter of the query of music data may be a character ‘t’ included inthe string having the set of characters ‘t’, ‘h’, and ‘e’ as the firstcharacters of the query of music data provided by the user when the setamount of time between keystrokes is exceeded after entering thecharacter ‘t’.

The system may further include a timer module to apply a timer in theclient device to measure the set amount of time between keystrokes. Anoptimal time between keystrokes may be approximately 200 milliseconds.The system may also include a keystroke module of the client device tohold the partial entry in the client device without transmitting thepartial entry to the fast-search server when the partial entry is afirst three characters of the query of music data when the set amount oftime between keystrokes is within the optimal time between keystrokes.

The system may include a four-send module of the client device totransmit the partial entry in the client device to the fast-searchserver regardless of the set amount of time between keystrokes beingwithin the optimal time between keystrokes when the partial entry may bea first four characters of the query of music data to optimize anexperience of the user to feel that the fast-search server is quicklyresponsive to the user. In addition, the system may also include a spacemodule of the client device to hold the partial entry in the clientdevice without transmitting the partial entry to the fast-search serverwhen the partial entry may be a ‘blank space’ character of the query ofmusic data to minimize trips between the client device and thefast-search server.

The system may further include a delete module of the client device toapply the local cache to retrieve a previous record of previouscharacters typed in the query of music data before the user entered thepartial entry of the query through an application of the local cache inproviding the previous data record when the user deletes an entry of anycharacter of the query from the query.

The methods, systems, and apparatuses disclosed herein may beimplemented in any means for achieving various aspects, and may beexecuted in a form of a machine-readable medium embodying a set ofinstructions that, when executed by a machine, cause the machine toperform any of the operations disclosed herein. Other features will beapparent from the accompanying drawings and from the detaileddescription that follows.

BRIEF DESCRIPTION OF THE DRAWINGS

Example embodiments are illustrated by way of example and not limitationin the FIG.s of the accompanying drawings, in which like referencesindicate similar elements and in which:

FIG. 1 is a system view of a set of client devices communicating with afast-search server coupled to a central server, according to oneembodiment.

FIG. 2 is an exploded view of the client device, according to oneembodiment.

FIG. 3 is an exploded view of the fast-search server, according to oneembodiment.

FIG. 4 is a table view of details associated with text match of partialquery with the record data of the music database, according to oneembodiment.

FIG. 5 is a user interface view of a searching a record data associatedwith music data by entering the query in the query box and getting theresponse associated with the partial query before the completion ofquery associated with the music data, according to one embodiment.

FIG. 6 is a diagrammatic system view of a data processing system,according to one embodiment.

FIG. 7A is a process flow of searching a data record of music databaseand storing a search data and a results data in a local cache, accordingto one embodiment.

FIG. 7B is a continuation of the process flow of FIG. 7A illustratingadditional processes, according to one embodiment.

FIG. 7C is a continuation of the process flow of FIG. 7B illustratingadditional processes, according to one embodiment.

FIG. 8A is a process flow of controlling the flow of characters to thefast-search server, according to one embodiment.

FIG. 8B is a continuation of the process flow of FIG. 8A illustratingadditional processes, according to one embodiment.

Other features of the present embodiments will be apparent from theaccompanying drawings and from the detailed description that follows.

DETAILED DESCRIPTION

A method and system of directory sharing and management in a groupcommunication environment is disclosed. In the following description,for the purposes of explanation, numerous specific details are set forthin order to provide a thorough understanding of the various embodiments.It will be evident, however to one skilled in the art that the variousembodiments may be practiced without these specific details.

In one embodiment, a method of a fast-search server (e.g., the fastsearch server 106 of FIG. 1) includes processing a character of a queryof music data, referencing the character with a reverse index (e.g., thereverse index 110 of FIG. 1) of a music database (e.g., the musicdatabase 112 of FIG. 1), determining that the character matches a datarecord (e.g., may include an artist name, an artist album, a genre, analbum data, a track data, a lyrics data, a blog post data, a userprofile data, a user interest data, and/or a playlist data) of the musicdatabase 112 using the reverse index 110, and returning the data recordof the music database 112 prior to receiving all characters of the queryof music data from a user (e.g., the user 104 of FIG. 1).

In another embodiment, a method of improving music search responsivenessincludes determining that a partial entry of a query of music data isincluded in a local cache (e.g., the local cache 214 of FIG. 2) of aclient device (e.g., the client device 102A-N of FIG. 1) built fromprevious searches of users (e.g., present in search cache 216 of FIG. 2)of a central server (e.g., the central server 108 of FIG. 1) having themusic data and returning a data record (e.g., present in results cache218 of FIG. 2) from the local cache 214 based on the previous searchesof the users 104 of the central server 108 having the music data.

In yet another embodiment, a system includes the central server 108 toprovide data records (e.g., may include an artist name, an artist album,a genre, an album data, a track data, a lyrics data, a blog post data, auser profile data, a user interest data, and/or a playlist data) of amusic database 112, a fast-search server 106 coupled to the centralserver 108 having a processing module (e.g., the processing module 200of FIG. 2) to monitor and be responsive to a partial entry of a query ofthe data records of the music database 112 using a reverse index 110 ofthe data records of the music database 112, a network (e.g., the network100 of FIG. 1) and a client device 102A-N coupled to the central server108 and the fast-search server 106 through the network 100 to locallycache 214 previous partial searches (e.g., using the search cache 216 ofFIG. 1) and results of users of client devices (e.g., using the resultscache 218 of FIG. 1) which query the data records of the music database112 of the central server 108.

FIG. 1 is a system view of a set of client devices 102 communicatingwith a fast-search server 106 coupled to a central server 108, accordingto one embodiment. Particularly, FIG. 1 illustrates a network 100,client devices 102A-N, a user 104, a fast-search server 106, a centralserver 108, a reverse index 110 and a music database 112, according toone embodiment.

The network 100 (e.g., Internet, wireless Internet, WAN, LAN, Bluetooth,Wi-Fi, Wi-Max, telecommunications, radio frequency and/or infrarednetwork, etc.) may enable communication between the user 104 and thecentral server 108 through the fast search server 106. The clientdevices 102A-N (e.g., personal computer, a mobile phone, etc.) mayenable the user 104 to transmit a query for data records associated withthe music database 112 (e.g., artist name, track name, album name, etc.)to the central server 108.

The user 104 may have a query associated with the music data (e.g.,artist name, track name, album name, etc.). The fast-search server 106may accept the incoming characters of query entered by the user 104 evenbefore the query is completed and may reference them with the reverseindex 110 of a music database 112 to get the response associated withthe partial query. The central server 108 may include a music database112 which may have all the record data associated with the music (e.g.,artist name, track name, album name, etc.).

The reverse index 110 may be created from a combination of lettersappearing as a string in a data field of the music database 112including an artist field, an album field, and/or a track. Thecharacters of the query may be referenced to the reverse index 110 inorder to determine the music information associated with query to getthe response associated with query from the music database 112. Themusic database 112 may include all the information associated with themusic data (e.g., artist name, album name, track numbers, kind of music,etc.).

In the example embodiment illustrated in FIG. 1, the user 104 mayinteract with the central server 108 from the client devices 102A-Nthrough the network 100 (e.g., internet). The fast-search server 106 mayinteract with the client devices 102A-N accepting the characters from apartial query entered by the user 104 and may provide a responseassociated with the partial query to the client devices 102A-N.

In one embodiment, a central server 108 may provide data records (e.g.,may include an artist name, an artist album, a genre, an album data, atrack data, a lyrics data, a blog post data, a user profile data, a userinterest data, and/or a playlist data) of a music database 112. Afast-search server 106 coupled to the central server 108 may have aprocessing module 110 to monitor and be responsive to a partial entry ofa query of the data records of the music database 112 using a reverseindex (e.g., the reverse index 304 of FIG. 3) of the data records of themusic database 112. The system may include a network 100.

A client device 102A-N coupled to the central server 108 and thefast-search server 106 through the network may locally cache previouspartial searches and results of users of client devices which query thedata records of the music database of the central server. The reverseindex may be created from a combination of letters appearing as a stringin a data field of the music database and from data fields of the musicdatabase including an artist field, an album field, and/or a track. Theuser 104 may search for a particular information associated with themusic data using a query. The characters may be transmitted to thefast-search server before the query input is completed and the possibleresponse associated with query is transmitted back to client device.

FIG. 2 is an exploded view of the client devices 102A-N of FIG. 1,according to one embodiment. Particularly, FIG. 2 illustrates anoptimization module 200, a keystroke module 202, a timer module 204, aspace module 206, a four-send module 208, symbol detection module 210, adelete module 212, a local cache 214, a search cache 216 and resultscache 218, according to one embodiment.

The optimization module 200 may hold the partial entry of the query(e.g., en for Enrique, enigma, etc.) of the data records of the musicdatabase 112 in the client device 102A-N without transmitting thepartial entry to the fast-search server 106 when characters of thepartial entry are part of a string having a set of characters ‘t’, ‘h’,and ‘e’ as first characters of the query of the data records of themusic database 112 when a set amount of time between keystrokes (e.g.,200 milliseconds) is not exceeded.

The keystroke module 202 may hold the partial entry in the client device102A-N without transmitting the partial entry to the fast-search server106 when the partial entry is a first three characters of the query ofmusic data (e.g., bil for Bilamos, Billy, etc.) when the set amount oftime between keystrokes is within the optimal time (e.g., 200milliseconds) between keystrokes. The timer module 204 may apply a timerin the client device 102A-N to measure the set amount of time betweenkeystrokes.

The space module 206 may hold the partial entry in the client device102A-N without transmitting the partial entry to the fast-search server106 when the partial entry is a ‘blank space’ character of the query ofmusic data to minimize trips between the client device 102A-N and thefast-search server 106. The four-send module 208 may transmit thepartial entry in the client device 102A-N to the fast-search server 106regardless of the set amount of time between keystrokes being within theoptimal time between keystrokes (e.g., 200 milliseconds) when thepartial entry is a first four characters of the query of music data(e.g., Ast for a group named Astroidrocker's songs, etc.) to optimize anexperience of the user 104 to feel that the fast-search server 106 isquickly responsive to the user 104.

The symbol detection module 210 may transmit any symbols by the user 104and respond to them in association with music data containing symbols(e.g., pi (symbol) representing Clint Mansell). The delete module 212may apply the local cache to retrieve a previous record of previouscharacters typed in the query of music data (e.g., track name, artistname, etc.) before the user 104 entered the partial entry of the querythrough an application of the local cache 214 in providing the previousdata record when the user 106 deletes an entry of any character of thequery from the query. The local cache 214 may contain search cache 216and results cache 218.

The local cache 214 may contain the information associated with previoussearches, results and/or queries. The search cache 216 may have thecontent (e.g., search content) associated with the previous search andqueries (e.g., Enrique, enigma, etc.). The results cache 218 may havethe result (e.g., en for Enrique, enigma, etc.) content associated withthe previous queries.

In the example embodiment illustrated in FIG. 2, the client device102A-N may include the optimization module 200, keystroke module 202,space module 206, four-send module 208, symbol detection module 210,delete module 212 may communicate with each other to control (e.g.,hold, transmit, etc.) the flow of characters from the client device102A-N to the fast-search server 106 through a network (e.g., internet).The timer module 204 may keep the track of timings (e.g., using systemclock, etc.) associated with the keystrokes.

The local cache 214 includes search cache 216 and results cache 218containing information of previous search and/or results, according tothe example embodiment illustrated in FIG. 2. The local cache 214 may beused to get the music data associated with the query using previoussearches and corresponding results when the query is similar to theprevious search query.

In one embodiment, a character may be processed of a query of music data(e.g., artist name, album name, etc.). The character may be referencedwith a reverse index 110 of a music database 112. It may be determinedthat the character matches a data record (e.g., may include an artistname, an artist album, a genre, an album data, a track data, a lyricsdata, a blog post data, a user profile data, a user interest data,and/or a playlist data) of the music database 112 using the reverseindex 110.

The data record of the music database 112 may be returned prior toreceiving all characters of the query of music data from a user 106. Thereverse index 110 may be created from a combination of letters appearingas a string in a data field of the music database 112 and from datafields of the music database 112 including an artist field, an albumfield, and/or a track field. A search data (e.g., may include theprevious characters typed in the query and/or other characters providedby different users querying the data record) of the user 104 and otherusers may be stored in a local cache 214 of a client device 102A-N tooptimize speed of returning the data record of the music database 112prior to receiving all characters of the query of music data from theuser 104.

A results data (e.g., may include the data record matching the searchdata) of the user 104 and other users may be stored in the local cache214 of the client device 102A-N to further optimize speed of returningthe data record of the music database 112 prior to receiving allcharacters of the query of music data from the user 104. The local cache214 may be applied to retrieve a previous data record of previouscharacters typed in the query of music data before the user entered thecharacter of the query through an application of the search data (e.g.,using the magic button 502 of FIG. 5) and the results data of the localcache 214 in providing the previous data record when the user 104deletes an entry of the character of the query from the query.

The character of the query of music data may be held in a client device102A-N without transmitting the character to the fast-search server 106when the character of the query of music data is included in a stringhaving a set of characters ‘t’, ‘h’, and ‘e’ as first characters of thequery of music data provided by the user 104 when a set amount of timebetween keystrokes (e.g., 200 milliseconds) is not exceeded.

The character of the query of music data in the client device 102A-N maybe transmitted to the fast-search server 106 when the character of thequery of music data is a character ‘t’ included in the string having theset of characters ‘t’, ‘h’, and ‘e’ as the first characters of the queryof music data provided by the user 104 when the set amount of timebetween keystrokes is exceeded after entering the character ‘t’.

A timer (e.g., a clock) may be applied in the client device 102A-N tomeasure the set amount of time between keystrokes. An optimal timebetween keystrokes may be approximately 200 milliseconds. A first threecharacters of the query of music data may be held in the client device102A-N without transmitting the character to the fast-search server 106when the set amount of time between keystrokes is within the optimaltime between keystrokes.

A first four characters of the query of music data in the client device102A-N may be transmitted to the fast-search server 106 regardless ofthe set amount of time between keystrokes being within the optimal timebetween keystrokes to optimize an experience of the user 104 to feelthat the fast-search server 106 is quickly responsive to the user 104. A‘blank space’ character of the query of music data may be held in theclient device 102A-N without transmitting the ‘blank space’ character tothe fast-search server 106 to minimize trips between the client device102A-N and the fast-search server 106.

It may be determined that a partial entry of a query of music data isincluded in a local cache 214 of a client device 102A-N built fromprevious searches of users 104 of a central server 108 having the musicdata. A data record may be returned from the local cache 214 based onthe previous searches of the users 104 of the central server 108 havingthe music data. The partial entry of the query of music data may be heldin the client device 102A-N without transmitting the partial entry to afast-search server 106 when characters of the partial entry are includedin a string having a set of characters ‘t’, ‘h’, and ‘e’ as firstcharacters of the query of music data provided by the user 104 when aset amount of time between keystrokes is not exceeded.

The partial entry of the query of music data in the client device 102A-Nmay be transmitted to the fast-search server 106 when a character of thepartial entry is a character ‘t’ included in the string having the setof characters ‘t’, ‘h’, and ‘e’ as the first characters of the query ofmusic data provided by the user 104 when the set amount of time betweenkeystrokes is exceeded after entering the character ‘t’. The timer maybe applied in the client device 102A-N to measure the set amount of timebetween keystrokes.

The optimal time between keystrokes may be approximately 200milliseconds. The partial entry may be held in the client device 102A-Nwithout transmitting the partial entry to the fast-search server 106when the partial entry is a first three characters of the query of musicdata when the set amount of time between keystrokes is within theoptimal time between keystrokes. The partial entry in the client device102A-N may be transmitted to the fast-search server 106 regardless ofthe set amount of time between keystrokes being within the optimal timebetween keystrokes when the partial entry is a first four characters ofthe query of music data to optimize an experience of the user 104 tofeel that the fast-search server is quickly responsive to the user 104.

The partial entry may be held in the client device 102A-N withouttransmitting the partial entry to the fast-search server 106 when thepartial entry is a ‘blank space’ character of the query of music data tominimize trips between the client device 102A-N and the fast-searchserver 106. An optimization module (e.g., the optimization module 200 ofFIG. 2) of the client device 102A-N may hold the partial entry of thequery of the data records of the music database 112 in the client device102A-N without transmitting the partial entry to the fast-search server106 when characters of the partial entry are part of a string having aset of characters ‘t’, ‘h’, and ‘e’ as first characters of the query ofthe data records of the music database 112 when a set amount of timebetween keystrokes is not exceeded, and to transmit the partial entry ofthe query of music data in the client device 102A-N to the fast-searchserver 106 when a character of the query of music data is a character‘t’ included in the string having the set of characters ‘t’, ‘h’, and‘e’ as the first characters of the query of music data provided by theuser 104 when the set amount of time between keystrokes is exceededafter entering the character ‘t’.

A timer module may apply a timer in the client device 102A-N to measurethe set amount of time between keystrokes. The optimal time betweenkeystrokes may be approximately 200 milliseconds. The keystroke module202 of the client device 102A-N may hold the partial entry in the clientdevice 102A-N without transmitting the partial entry to the fast-searchserver 106 when the partial entry is the first three characters of thequery of music data when the set amount of time between keystrokes iswithin the optimal time between keystrokes.

The four-send module 208 of the client device 102A-N may transmit thepartial entry in the client device 102A-N to the fast-search 106 serverregardless of the set amount of time between keystrokes being within theoptimal time between keystrokes when the partial entry is a first fourcharacters of the query of music data to optimize an experience of theuser 104 to feel that the fast-search server 106 is quickly responsiveto the user 104. The space module 206 of the client device 102A-N mayhold the partial entry in the client device 102A-N without transmittingthe partial entry to the fast-search server 106 when the partial entryis a ‘blank space’ character of the query of music data to minimizetrips between the client device 102A-N and the fast-search server 106.

The delete module 212 of the client device 102A-N may apply the localcache 214 to retrieve a previous record of previous characters typed inthe query of music data before the user 104 entered the partial entry ofthe query through an application of the local cache 214 in providing theprevious data record when the user 104 deletes an entry of any characterof the query from the query.

FIG. 3 is an exploded view of the fast-search server 106 of FIG. 1,according to one embodiment. Particularly, FIG. 3 illustrates aprocessing module 300, a spelling module 302, a comparison module 304,an approximation module 306, a text matching module 308, a preforkmodule 310, a concurrency minimization module 312, and a spelling indexmodule 314, according to one embodiment.

The processing module 300 may monitor and be responsive to a partialentry of a query of the data records of the music database 112 using areverse index 110 of the data records of the music database 112. Thespelling module 302 may apply a spelling index 314 which references amisspelling database of the central server 108 to determine whether aquery of music data is a misspelling of the data records of the centralserver 108, and may alter the misspelling of the query of music data toa correct spelling when the query of music data is determined to be themisspelling of one of the data records.

The comparison module 304 may compare the query to previous searchqueries to respond if the query matches to the previous search queries.The approximation module 306 module may pull out all the approximateresults associated with the query. The text matching module 308 may pullout all the records (e.g., artist name, album, track, blogs, etc.)associated with the query having the matching text.

The prefork module 310 may prefork the character of the query of musicdata along with other processes in the fast-search server 106 tominimize concurrency issues and/or to minimize threading locks. Theconcurrency minimization module 312 minimize in association with theprefork module 310 may minimize the concurrency issues. The spellingindex module 314 may refer a misspelling database of a central server108 to determine whether the query of music data (e.g., em in place ofen for Enrique) is a misspelling of the data record of the centralserver 108.

In the example embodiment illustrated in FIG. 3, the fast-search server106 may include the processing module 300 and reverse index 110communicating with each other. The text matching module 308 and reverseindex 110 may communicate with each other. The spelling module 302 maycommunicate with approximation module 306 the spelling index 314, andthe comparison module 304. The approximation module 306 and preforkmodule 310 may communicate with each other. The concurrency minimizationmodule 312 and the prefork module 310 may communicate with each other,according to the example embodiment illustrated in FIG. 3.

In one embodiment, the character of the query of music data may bepreforked along with other processes in the fast-search server (e.g.,the fast search server 106 of FIG. 1) to minimize concurrency issues andto minimize threading locks. A spelling index of the fast-search servermay be applied which references a misspelling database of a centralserver (e.g., the central server 106 of FIG. 1) to determine whether thequery of music data is a misspelling of the data record of the centralserver 106. The misspelling of the query of music data may be altered toa correct spelling when the query of music data is determined to be themisspelling of the data record.

A spelling module 302 of the fast-search server 106 may apply a spellingindex 314 which references a misspelling database of the central server108 to determine whether a query of music data is a misspelling of thedata records of the central server 108, and to alter the misspelling ofthe query of music data to a correct spelling when the query of musicdata is determined to be the misspelling of one of the data records. Thespelling index 314 may include combinations of spellings for referringthe wrong spelling to correct one in order to get an accurate responseassociated with the query.

The characters of the query may be referenced to the reverse index 110in order to determine the music information associated with query to getthe response associated with query from the music database 112.

FIG. 4 is a table view of details associated with text match of partialquery with the record data of the music database 112, according to oneembodiment. Particularly, FIG. 4 illustrates a partial entry field 402,a reverse index location field 404, a artist match field 306, an albummatch field 408, a track match field 410, a lyric match field 412, ablog match field 414, a play list match field 416 and an other field418, according to one embodiment.

The partial entry field 402 may display a partial query (e.g., mor, en,ba, etc.). The reverse index location field 404 may display the locationof the reverse index 110 associated with the query. The artist matchfield 306 may display the name of the artists matching with text of thepartial query (e.g., en for Enrique, mor for Morrison, etc.). The albummatch field 408 may display titles of the album (e.g., More is excess,etc.) matching with text of the partial query. The track match field 410may display the tracks (e.g., mor e le, etc.) matching with text of thepartial query.

The lyric match field 412 may display a part of lyrics (e.g., haaamoreeee, etc.) which matches with text of the partial query. The blogmatch field 414 may display the text present in the blog (e.g., theimportant is more, etc.) associated with the music data. The playlistmatch field 416 may display playlist title matching with the text of thequery. The other field 418 may display any other information thatmatches with the characters associated with the partial query text inthe central server 108.

In the example embodiment illustrated in FIG. 4, the partial entry field302 displays “mor” in the first row, indicating the partial query (e.g.,en for Enrique, etc.) in the partial entry 402 column. The reverse indexlocation field 404 displays “1523.5125.1245.21” in the first row,indicating the IP address (e.g., location of reverse index) in thereverse index location field 404 column. The artist match field 406displays “Morrison, Kurt” in the first row, “Morland, Jack” in thesecond row, “Steven, Morry” in the third row, indicating the artist name(e.g., Enrique, Ricky Martin, etc.) in the artist match field 406 columnthat is matching with the text of the parial query.

The artist match field 406 displays “Morrison, Kurt” in the first row,“Morland, Jack” in the second row, “Steven, Morry” in the third row,indicating the artist name (e.g., Enrique, Ricky Martin, etc.) in theartist match field 406 column that is matching with the text of theparial query.

The album match field 408 displays “more is excess” in the fourth row,“fight the skidmore” in the fifth row, indicating the album name (e.g.,aqua, etc.) in the album field 408 column that is matching with the textof the parial query. The track match field 410 displays “mor e le” inthe sixth row, indicating the track name (e.g., everything I do of BryanAdams, etc.) in the track match field 410 column that is matching withthe text of the parial query. The lyric match field 412 displays “haaamoreeee” in the seventh row, indicating the text of part of lyric (e.g.,“my oh my” of Aqua, etc.) in the lyric match field 412 column that ismatching with the text of the parial query.

The blog match field 414 displays “the important is mor” in the eightrow, indicating the text content in blog in the blog match field 414column that is matching with the text of the parial query. The play listmatch field 416 displays “none” in the ninth row, indicating the nothingin the play list match field 416 column that is matching with the textof the parial query. The other field 418 displays “none” in the ninthrow, indicating the nothing matching in the other field 418 column thatis matching with the text of the parial query.

FIG. 5 is a user interface view 550 of a searching a record dataassociated with music data by entering the query in the query box 502and getting the response associated with the partial query before thecompletion of query associated with the music data, according to oneembodiment. Particularly, FIG. 5 illustrates a query box 500, a magicbutton 502, a artist results 504, an album results 506 and a tracksresults 508, according to one embodiment.

The query box 500 may be a text box where the user 102 may input hisquery associated with music data. The magic button 502 may enable theuser 104 to set up a local cache 214 in the client device 102A-N. Theartist results 504 may display the possible artists names (e.g., Enigma,etc. as illustrated in the FIG. 5) that are matching the text of theuser's partial query (e.g., eni, as illustrated in FIG. 5). The albumresults 506 may display the possible album names (e.g., Enigmatica, etc.as illustrated in FIG. 5) matching with the text of the user's partialquery (e.g., eni, as illustrated in FIG. 5). The tracks results 508 maydisplay the possible track names that are matching with the text of theuser's 104 partial query (e.g., eni, as illustrated in FIG. 5).

In the example embodiment illustrated in FIG. 5, the user interface view550 displays the user's 104 query in the query box 502. The response forthe partial query may be seen as a window near the query box 502including artists results 504, the album results 506, the track results508, etc. The magic button 502 may allow the user 104 to set up a cachein the client device 102A-N.

FIG. 6 is a diagrammatic system view 650 of a data processing system inwhich any of the embodiments disclosed herein may be performed,according to one embodiment. Particularly, the diagrammatic system view650 of FIG. 6 illustrates a processor 602, a main memory 604, a staticmemory 606, a bus 608, a video display 610, an alpha-numeric inputdevice 612, a cursor control device 614, a drive unit 616, a signalgeneration device 618, a network interface device 620, a machinereadable medium 622, instructions 624 and a network 626, according toone embodiment.

The diagrammatic system view 600 may indicate a personal computer and/ora data processing system in which one or more operations disclosedherein may be performed. The processor 602 may be a microprocessor, astate machine, an application-specific integrated circuit, a fieldprogrammable gate array, etc. (e.g., Intel® Pentium® processor). Themain memory 604 may be a dynamic random access memory and/or a primarymemory of a computer system. The static memory 606 may be a hard drive,a flash drive, and/or other memory information associated with the dataprocessing system.

The bus 606 may be an interconnection between various circuits and/orstructures of the data processing system. The video display 610 mayprovide graphical representation of information on the data processingsystem. The alpha-numeric input device 612 may be a keypad, a keyboardand/or any other input device of text (e.g., a special device to aid thephysically challenged). The cursor control device 614 may be a pointingdevice such as a mouse.

The drive unit 616 may be the hard drive, a storage system, and/or otherlonger term storage subsystem. The signal generation device 618 may be abios and/or a functional operating system of the data processing system.The network interface device 620 may be a device that may performinterface functions such as code conversion, protocol conversion and/orbuffering required for communication to and from a network 626.

The machine readable medium 622 may provide instructions on which any ofthe methods disclosed herein may be performed. The instructions 624 mayprovide source code and/or data code to the processor 602 to enable anyone or more operations disclosed herein.

FIG. 7A is a process flow of searching a data record of music database(the music database 112 of FIG. 1) and storing a search data and aresults data in a local cache (e.g., the local cache 214 of FIG. 2),according to one embodiment. In operation 702, a character may beprocessed of a query of music data. In operation 704, the character maybe referenced with a reverse index (e.g., the reverse index 110 ofFIG. 1) of a music database (e.g., the music database 112 of FIG. 1).

In operation 706, the character may be determined that matches a datarecord of the music database 112 using the reverse index 110 (e.g.,using a fast-search server 106 of FIG. 1). In operation 708, the datarecord of the music database 112 may be returned prior to receiving allcharacters of the query of music data from a user (e.g., the user 104 ofFIG. 1). For example, the reverse index may be created from acombination of letters appearing as a string in a data field of themusic database 112 including an artist field, an album field/or and atrack field.

In operation 710, the search data (e.g., may include the previouscharacters typed in the query, other characters provided by differentusers querying the data record and/or the results data includes the datarecord matching the search data) of the user 104 and other users may bestored in the local cache 214 (e.g., in the search cache 216 in localcache 214 of FIG. 2) of a client device 102A-N to optimize speed ofreturning the data record of the music database 112 prior to receivingall characters of the query of music data from the user 104.

In operation 712, the results data (e.g., may includes the data recordmatching the search data) of the user 104 and other users may be storedin the local cache 214 of the client device 102A-N (e.g., the resultscache 218 in local cache 214 of FIG. 2) to further optimize speed ofreturning the data record of the music database 112 prior to receivingall characters of the query of music data from the user 104.

FIG. 7B is a continuation of the process flow of FIG. 7A illustratingadditional processes, according to one embodiment. In operation 714, thecharacter of the query of music data may be preforked (e.g., using theprefork module 310 of FIG. 3) along with other processes in thefast-search server (e.g., the fast-search server 106 of FIG. 1) tominimize concurrency issues and to minimize threading locks.

In operation 716, the local cache 214 may be applied to retrieve aprevious data record of previous characters typed in the query of musicdata (e.g., using the magic button 502 of FIG. 5) before the user 104entered the character of the query through an application of the searchdata and the results data of the local cache 214 in providing theprevious data record when the user 104 deletes an entry of the characterof the query from the query.

In operation 718, the character of the query of music data may be heldin a client device 102 A-N without transmitting the character to thefast-search server 106 when the character of the query of music data maybe included in a string having a set of characters ‘t’, ‘h’, and ‘e’ asfirst characters of the query of music data (e.g., using theoptimization module 200 of FIG. 2) provided by the user 104 when a setamount of time (e.g., 200 milliseconds) between keystrokes is notexceeded.

In operation 720, the character of the query of music data may betransmitted in the client device 102A-N to the fast-search server 106when the character of the query of music data may be a character ‘t’included in the string having the set of characters ‘t’, ‘h’, and ‘e’ asthe first characters of the query of music data (e.g., using theoptimization module 200 of FIG. 2) provided by the user 104 when the setamount of time between keystrokes may be exceeded after entering thecharacter ‘t’.

In operation 722, a timer (e.g., a clock, countdown, etc.) may beapplied (e.g., using a timer module 204 of FIG. 2) in the client device102A-N to measure the set amount of time between keystrokes. An optimaltime between keystrokes may be approximately 200 milliseconds. Inoperation 724, a first three characters of the query of music data maybe held (e.g., using a keystroke module 202 of FIG. 2) in the clientdevice 102A-N without transmitting the character (e.g., enr for Enrique,etc.) to the fast-search server 106 when the set amount of time betweenkeystrokes may be within the optimal time (e.g., 200 milliseconds)between keystrokes.

FIG. 7C is a continuation of the process flow of FIG. 7B illustratingadditional processes, according to one embodiment. In operation 726, afirst four characters of the query of music data may be transmitted(e.g., using the four-send module 208 of FIG. 2) in the client device102A-N to the fast-search server 106 regardless of the set amount oftime between keystrokes (e.g., time gap between typing two keys) beingwithin the optimal time (e.g., 200 milliseconds) between keystrokes tooptimize an experience of the user 104 to feel that the fast-searchserver 106 may be quickly responsive to the user 104.

In operation 728, a ‘blank space’ character of the query of music datamay be held (e.g., using the space module 206 of FIG. 2) in the clientdevice 102A-N without transmitting the ‘blank space’ character to thefast-search server to minimize trips between the client device 102A-Nand the fast-search server 106. In operation 730, a spelling index maybe applied (e.g., using the spelling module 302 of FIG. 3) in thefast-search server 106 which references a misspelling database of acentral server 108 to determine whether the query of music data may bemisspelling of the data record of the central server 108. In operation732, the misspelling of the query of music data to a correct spellingmay be altered when the query of music data may be determined to be themisspelling of the data record.

FIG. 8A is a process flow of controlling the flow of characters to thefast-search server (e.g., the fast-search server 106 of FIG. 1),according to one embodiment. In operation 802, a partial entry of a maybe determined query of music data may be included in a local cache(e.g., the local cache 214 of FIG. 2) of a client device (e.g., theclient device 102A-N of FIG. 1) built from previous searches of a usersof a central server (e.g., the central server 108 of FIG. 1) having themusic data. In operation 804, a data record may be returned (e.g., usingresults cache 218 of FIG. 2) from the local cache 214 based on theprevious searches of the users (e.g., from search cache 216 of FIG. 2)of the central server 108 having the music data.

In operation 806, the partial entry of the query of music data may beheld (e.g., using the optimization module 200 of FIG. 2) in the clientdevice 102A-N without transmitting the partial entry to the fast-searchserver 106 when characters of the partial entry are included in a stringhaving a set of characters ‘t’, ‘h’, and ‘e’ as first characters of thequery of music data provided by the user 104 when a set amount of timebetween keystrokes is not exceeded.

In operation 808, the partial entry of the query of music data may betransmitted (e.g., using the optimization module 200 of FIG. 2) in theclient device 102A-N to the fast-search server 106 when a character ofthe partial entry is a character ‘t’ included in the string having theset of characters ‘t’, ‘h’, and ‘e’ as the first characters of the queryof music data provided by the user 104 when the set amount of timebetween keystrokes is exceeded after entering the character ‘t’.

FIG. 8B is a continuation of the process flow of FIG. 8A illustratingadditional processes, according to one embodiment. In operation 810, atimer may be applied (e.g., using the timer module 204 of FIG. 2) in theclient device 102A-N to measure the set amount of time betweenkeystrokes. An optimal time between keystrokes may be approximately 200milliseconds. In operation 812, the partial entry may be held (e.g.,using the keystroke module 202 of FIG. 2) in the client device 102A-Nwithout transmitting the partial entry to the fast-search server 106when the partial entry may be first three characters of the query ofmusic data when the set amount of time between keystrokes may be withinthe optimal time between keystrokes.

In operation 814, the partial entry may be transmitted (e.g., using thefour-send module 208 of FIG. 2) in the client device 102A-N to thefast-search server 106 regardless of the set amount of time betweenkeystrokes being within the optimal time between keystrokes when thepartial entry may be first four characters of the query of music data tooptimize an experience of the user 104 to feel that the fast-searchserver 106 is quickly responsive to the user.

In operation 816, the partial entry may be held (e.g., using the spacemodule 206 of FIG. 2) in the client device 102A-N without transmittingthe partial entry to the fast-search server 106 when the partial entrymay be a ‘blank space’ character of the query of music data to minimizetrips between the client device 102A-N and the fast-search server 106.

Although the present embodiments have been described with reference tospecific example embodiments, it will be evident that variousmodifications and changes may be made to these embodiments withoutdeparting from the broader spirit and scope of the various embodiments.For example, the various devices, modules, analyzers, generators, etc.described herein may be enabled and operated using hardware circuitry(e.g., CMOS based logic circuitry), firmware, software and/or anycombination of hardware, firmware, and/or software (e.g., embodied in amachine readable medium). For example, the various electrical structureand methods may be embodied using transistors, logic gates, andelectrical circuits (e.g., Application Specific Integrated Circuitry(ASIC) and/or in Digital Signal Processor (DSP) circuitry).

For example, the optimization module 200, the keystroke module 202, thetimer module 204, the space module 206, the four-send module 208, thesymbol detection module 210, the delete module 212, the processingmodule 300, the spelling module 302, a comparison module 304, theapproximation module 306, the text matching module 308, the preforkmodule 310, the concurrency minimization module 312, and the spellingindex module 314 and/or other modules of FIGS. 1-8B may be enabled usingan optimization circuit, a keystroke circuit, a timer circuit, a spacecircuit, a four-send circuit, symbol detection circuit, a deletecircuit, a processing circuit, a spelling circuit, a comparison circuit,an approximation circuit, a text matching circuit, a prefork circuit, aconcurrency minimization circuit, and a spelling index circuit and/orother circuits using one or more of the technologies described herein.

In addition, it will be appreciated that the various operations,processes, and methods disclosed herein may be embodied in amachine-readable medium and/or a machine accessible medium compatiblewith a data processing system (e.g., a computer system), and may beperformed in any order.

The modules in the FIG.s are shown as distinct and communicating withonly a few specific module and not others. The modules may be mergedwith each other, may perform overlapping functions, and may communicatewith other modules not shown to be connected in the FIG.s. Accordingly,the specification and drawings are to be regarded in an illustrativerather than a restrictive sense.

What is claimed is:
 1. A client device, comprising: a memory; and aprocessor communicatively coupled to the memory, the processor beingconfigured to execute instructions to: receive a partial entry of aquery of music data input by a user of the client device; determinewhether the partial entry of the query of music data matches a localcache of the client device built from previous searches of a pluralityof users of a central server having the music data; in response to amatch between the partial entry and the local cache: return to theclient device the data record from the local cache prior to receivingall characters of the query from the client device; in response to nomatch between the partial entry and the local cache: (i) transmit thepartial entry of the query of music data, the partial entry including atleast a first three characters of the query, upon an occurrence of atleast one event, wherein the at least one event is when an amount oftime between keystrokes exceed a threshold amount of time betweenkeystrokes or when the partial entry includes a threshold number ofcharacters; (ii) receive a data record of a music database referencingthe at the least first three characters of the partial entry and storingthe data record in the local cache of the client device.
 2. The clientdevice of claim 1, further configured to: hold the partial entry of thequery of music data in the client device without transmitting thepartial entry from the client device when characters of the partialentry are included in a string having a set of characters ‘t’, ‘h’, and‘e’ as first characters of the query of music data provided by the userwhen a set amount of time between keystrokes is not exceeded; andtransmit the partial entry of the query of music data in the client whena character of the partial entry is a character included in the stringhaving the set of characters ‘t’, ‘h’, and ‘e’ as the first charactersof the query of music data provided by the user when the set amount oftime between keystrokes is exceeded after entering the character ‘t’. 3.The client device of claim 1, further configured to: communicativelycouple to a fast-search server and to hold the partial entry in theclient device without transmitting the partial entry to the fast-searchserver when the partial entry is a first three characters of the queryof music data when the set amount of time between keystrokes is withinthe optimal time between keystrokes; transmit the partial entry in theclient device to the fast-search server regardless of the set amount oftime between keystrokes being within the optimal time between keystrokeswhen the partial entry is a first four characters of the query of musicdata to optimize an experience of the user to feel that the fast-searchserver is quickly responsive to the user.
 4. The client device of claim1, further configured to: communicatively couple to a fast-search serverand to hold the partial entry in the client device without transmittingthe partial entry to the fast-search server when the partial entry is a‘blank space’ character of the query of music data to minimize tripsbetween the client device and the fast-search server.
 5. The clientdevice of claim 1, further configured to: communicatively couple to afast-search server and to apply a local cache to retrieve a previousrecord of previous characters typed in the query of music data beforethe user entered the partial entry of the query through an applicationof the local cache in providing the previous data record when the userdeletes an entry of any character of the query from the query.
 6. Theclient device of claim 1, wherein the threshold amount of time betweenkeystrokes is approximately 200 milliseconds.
 7. The client device ofclaim 1, wherein the threshold number of characters is four.
 8. Anon-transitory computer-readable medium containing instructions that,when executed by a client device, cause the client device to: receive apartial entry of a query of music data input by a user of the clientdevice; determine whether the partial entry of the query of music datamatches a local cache of the client device built from previous searchesof a plurality of users of a central server having the music data; inresponse to a match between the partial entry and the local cache:return to the client device the data record from the local cache priorto receiving all characters of the query from the client device; inresponse to no match between the partial entry and the local cache: (i)transmit the partial entry of the query of music data, the partial entryincluding at least a first three characters of the query, upon anoccurrence of at least one event, wherein the at least one event is whenan amount of time between keystrokes exceed a threshold amount of timebetween keystrokes or when the partial entry includes a threshold numberof characters; (ii) receive a data record of a music databasereferencing the at the least first three characters of the partial entryand storing the data record in the local cache of the client device. 9.The non-transitory computer-readable medium of claim 8, includingfurther instructions that when executed cause the client device to: holdthe partial entry of the query of music data in the client devicewithout transmitting the partial entry from the client device whencharacters of the partial entry are included in a string having a set ofcharacters ‘t’, ‘h’, and ‘e’ as first characters of the query of musicdata provided by the user when a set amount of time between keystrokesis not exceeded; and transmit the partial entry of the query of musicdata in the client when a character of the partial entry is a character‘t’ included in the string having the set of characters ‘t’, ‘h’, and‘e’ as the first characters of the query of music data provided by theuser when the set amount of time between keystrokes is exceeded afterentering the character ‘t’.
 10. The non-transitory computer-readablemedium of claim 8, including further instructions that when executedcause the client device to: communicatively couple to a fast-searchserver and to hold the partial entry in the client device withouttransmitting the partial entry to the fast-search server when thepartial entry is a first three characters of the query of music datawhen the set amount of time between keystrokes is within the optimaltime between keystrokes; transmit the partial entry in the client deviceto the fast-search server regardless of the set amount of time betweenkeystrokes being within the optimal time between keystrokes when thepartial entry is a first four characters of the query of music data tooptimize an experience of the user to feel that the fast-search serveris quickly responsive to the user.
 11. The non-transitorycomputer-readable medium of claim 8, including further instructions thatwhen executed cause the client device to: communicatively couple to afast-search server and to hold the partial entry in the client devicewithout transmitting the partial entry to the fast-search server whenthe partial entry is a ‘blank space’ character of the query of musicdata to minimize trips between the client device and the fast-searchserver.
 12. The non-transitory computer-readable medium of claim 8,including further instructions that when executed cause the clientdevice to: communicatively couple to a fast-search server and to apply alocal cache to retrieve a previous record of previous characters typedin the query of music data before the user entered the partial entry ofthe query through an application of the local cache in providing theprevious data record when the user deletes an entry of any character ofthe query from the query.
 13. The non-transitory computer-readablemedium of claim 8, wherein the threshold amount of time betweenkeystrokes is approximately 200 milliseconds.
 14. The non-transitorycomputer-readable medium of claim 8, wherein the threshold number ofcharacters is four.
 15. A computer-implemented method, comprising:receiving, at a client device, a partial entry of a query of music datainput by a user of the client device; determining whether the partialentry of the query of music data matches a local cache of the clientdevice built from previous searches of a plurality of users of a centralserver having the music data; in response to a match between the partialentry and the local cache: returning to the client device the datarecord from the local cache prior to receiving all characters of thequery from the client device; in response to no match between thepartial entry and the local cache: (i) transmitting the partial entry ofthe query of music data, the partial entry including at least a firstthree characters of the query, upon an occurrence of at least one event,wherein the at least one event is when an amount of time betweenkeystrokes exceed a threshold amount of time between keystrokes or whenthe partial entry includes a threshold number of characters; (ii)receiving a data record of a music database referencing the at the leastfirst three characters of the partial entry and storing the data recordin the local cache of the client device.
 16. The method 15 furthercomprising: holding the partial entry of the query of music data in theclient device without transmitting the partial entry from the clientdevice when characters of the partial entry are included in a stringhaving a set of characters ‘t’, ‘h’, and ‘e’ as first characters of thequery of music data provided by the user when a set amount of timebetween keystrokes is not exceeded; and transmitting the partial entryof the query of music data in the client when a character of the partialentry is a character ‘t’ included in the string having the set ofcharacters ‘t’, ‘h’, and ‘e’ as the first characters of the query ofmusic data provided by the user when the set amount of time betweenkeystrokes is exceeded after entering the character ‘t’.
 17. The method15 further comprising: communicatively coupling to a fast-search serverand holding the partial entry in the client device without transmittingthe partial entry to the fast-search server when the partial entry is afirst three characters of the query of music data when the set amount oftime between keystrokes is within the optimal time between keystrokes;transmitting the partial entry in the client device to the fast-searchserver regardless of the set amount of time between keystrokes beingwithin the optimal time between keystrokes when the partial entry is afirst four characters of the query of music data to optimize anexperience of the user to feel that the fast-search server is quicklyresponsive to the user.
 18. The method 15 further comprising:communicatively coupling to a fast-search server and holding the partialentry in the client device without transmitting the partial entry to thefast-search server when the partial entry is a ‘blank space’ characterof the query of music data to minimize trips between the client deviceand the fast-search server.
 19. The method 15 further comprising:communicatively coupling to a fast-search server and applying a localcache to retrieve a previous record of previous characters typed in thequery of music data before the user entered the partial entry of thequery through an application of the local cache in providing theprevious data record when the user deletes an entry of any character ofthe query from the query.
 20. The method 15, wherein the thresholdamount of time between keystrokes is approximately 200 milliseconds andthe threshold number of characters is four.